Rigidity of spherical codes
نویسندگان
چکیده
A packing of spherical caps on the surface of a sphere (that is, a spherical code) is called rigid or jammed if it is isolated within the space of packings. In other words, aside from applying a global isometry, the packing cannot be deformed. In this paper, we systematically study the rigidity of spherical codes, particularly kissing configurations. One surprise is that the kissing configuration of the Coxeter–Todd lattice is not jammed, despite being locally jammed (each individual cap is held in place if its neighbors are fixed); in this respect, the Coxeter–Todd lattice is analogous to the face-centered cubic lattice in three dimensions. By contrast, we find that many other packings have jammed kissing configurations, including the Barnes–Wall lattice and all of the best kissing configurations known in four through twelve dimensions. Jamming seems to become much less common for large kissing configurations in higher dimensions, and in particular it fails for the best kissing configurations known in 25 through 31 dimensions. Motivated by this phenomenon, we find new kissing configurations in these dimensions, which improve on the records set in 1982 by the laminated lattices.
منابع مشابه
Asymptotically Dense Spherical Codes—Part I: Wrapped Spherical Codes
A new class of spherical codes called wrapped spherical codes is constructed by “wrapping” any sphere packing in Euclidean space onto a finite subset of the unit sphere in one higher dimension. The mapping preserves much of the structure of , and unlike previously proposed maps, the density of wrapped spherical codes approaches the density of as the minimum distance approaches zero. We show tha...
متن کاملAsymptotically dense spherical codes - Part II: Laminated spherical codes
New spherical codes called laminated spherical codes are constructed in dimensions 2–49 using a technique similar to the construction of laminated lattices. Each spherical code is recursively constructed from existing spherical codes in one lower dimension. Laminated spherical codes outperform the best known spherical codes in the minimum distance sense for many code sizes. The density of a lam...
متن کاملA Characterization of Spherical Cone Metrics on Surfaces
We study the spherical cone metrics on surfaces from the point of view of inner angles. A rigidity result is obtained. The existence of spherical cone metric of Delaunay type is also established.
متن کاملA characterization of spherical polyhedron surfaces
A spherical polyhedron surface is a triangulated surface obtained by isometric gluing of spherical triangles. For instance, the boundary of a generic convex polytope in the 3sphere is a spherical polyhedron surface. This paper investigates these surfaces from the point of view of inner angles. A rigidity result is obtained. A characterization of spherical polyhedron surfaces in terms of the tri...
متن کاملAsymptotically dense spherical codes - Part h Wrapped spherical codes
A new class of spherical codes called wrapped spherical codes is constructed by “wrapping” any sphere packing in Euclidean space onto a finite subset of the unit sphere in one higher dimension. The mapping preserves much of the structure of , and unlike previously proposed maps, the density of wrapped spherical codes approaches the density of as the minimum distance approaches zero. We show tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011